A New Algorithm for Automatic History Matching
نویسندگان
چکیده
منابع مشابه
A New Algorithm for Automatic History Matching
W. H. CHEN G. R. GAVALAS J. H. SEINFELD M. L. WASSERMAN History-matching problems, in which reservoir parameters arc to be estimated from well pressure data, are formulated as optimal control problems. The necessary conditions for optimality lead naturally to gradient optimization methods for determining the optimal parameter estimates. The key feature of the approach is that reservoir properti...
متن کاملOptimization for Automatic History Matching
History matching is an inverse problem of partial differential equation on mathematics. We adopt the constrained non-linear optimization to handle this problem, defining the objective function as the weighted square sum of differences between the wells simulation values and the corresponding observation values. We develop an optimization computing program that include Zoutendijk feasible direct...
متن کاملAn Approach for Automatic Matching of Descriptive Addresses
Address matching (also called geocoding) is an applied spatial analysis which is frequently used in everyday life. Almost all desktop and web-based GIS environments are equipped with a module to match the addresses expressed in pre-defined standard formats on the map. It is an essential prerequisite for many of the functionalities provided by location-based services (e.g. car navigation). Sever...
متن کاملA Semi-Automatic Algorithm for Estimating Cobb Angle
Background: Scoliosis is the most common type of spinal deformity. A universal and standard method for evaluating scoliosis is Cobb angle measurement, but several studies have shown that there is intra- and inter- observer variation in measuring cobb angle manually.Objective: Develop a computer- assisted system to decrease operator-dependent errors in Cobb angle measurement.Methods: The spinal ...
متن کاملA New Matching Algorithm for Multidimensional Persistence
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of the values on its vertices. The resulting acyclic partial matching may be used to construct a reduced filtered complex with the same multidimensional persisten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Society of Petroleum Engineers Journal
سال: 1974
ISSN: 0197-7520
DOI: 10.2118/4545-pa